Localization and Cutting-Plane Methods
نویسنده
چکیده
4 Some specific cutting-plane methods 12 4.1 Bisection method on R . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 4.2 Center of gravity method . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 4.3 MVE cutting-plane method . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 4.4 Chebyshev center cutting-plane method . . . . . . . . . . . . . . . . . . . . . 16 4.5 Analytic center cutting-plane method . . . . . . . . . . . . . . . . . . . . . . 16
منابع مشابه
Comparison of two integration schemes for a micropolar plasticity model
Micropolar plasticity provides the capability to carry out post-failure simulations of geo-structures due to microstructural considerations and embedded length scale in its formulation. An essential part of the numerical implementation of a micropolar plasticity model is the integration of the rate constitutive equations. Efficiency and robustness of the implementation hinge on the type of int...
متن کاملA note on central cutting plane methods for convex programming
Most cutting plane methods, like that of Kelley and Cheney and Goldstein solve a linear approximation (localization) of the problem, and then generate an additional cut to remove the linear program's optimal point. Other methods, like the \central cutting" plane methods, calculate a center of the linear approximation and then adjust the level of the objective, or separate the current center fro...
متن کاملLogarithmic barrier decomposition methods
A computational study of some logarithmic barrier decomposition algorithms for semi{innnite programming is presented in this paper. The conceptual algorithm is a straightforward adaptation of the logarithmic barrier cutting plane algorithm which was presented recently by den Hertog et al., to solve semi-innnite programming problems. Usually decomposition (cutting plane methods) use cutting plan...
متن کاملLocalization of Eigenvalues in Small Specified Regions of Complex Plane by State Feedback Matrix
This paper is concerned with the problem of designing discrete-time control systems with closed-loop eigenvalues in a prescribed region of stability. First, we obtain a state feedback matrix which assigns all the eigenvalues to zero, and then by elementary similarity operations we find a state feedback which assigns the eigenvalues inside a circle with center and radius. This new algorithm ca...
متن کاملA unifying framework for several cutting plane methods for semidefinite programming
Cutting plane methods provide the means to solve large scale semidefinite programs (SDP) cheaply and quickly. We give a survey of various cutting plane approaches for SDP in this paper. These cutting plane approaches arise from various perspectives, and include techniques based on interior point cutting plane approaches, and an approach which mimics the simplex method for linear programming. We...
متن کامل